Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces
نویسنده
چکیده
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces ldp independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows exponentially in d (Robins and Salowe, 1995). Our upper bounds follow from characterizations of singularities of SMT’s due to Lawlor and Morgan (1994), which we extend, and certain lp-inequalities. We derive a general upper bound of d + 1 for the degree of vertices of an SMT in an arbitrary smooth d-dimensional Banach space (i.e. Minkowski space); the same upper bound for Steiner points having been found by Lawlor and Morgan. We obtain a second upper bound for the degrees of vertices in terms of 1-summing norms.
منابع مشابه
Approximating Minimum Steiner Point Trees in Minkowski
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملApproximating minimum Steiner point trees in Minkowski planes
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملQuantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees
In this note we prove two results on the quantitative illumination parameter f (d) of the unit ball of a d-dimensional normed space introduced by K. Bezdek (1992). The first is that f (d) = O(2dd2 log d). The second involves Steiner minimal trees. Let v(d) be the maximum degree of a vertex, and s(d) of a Steiner point, in a Steiner minimal tree in a d-dimensional normed space, where both maxima...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملFinding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition
Let G = (V, E) be a plane graph with nonnegative edge weights, and letN be a family of k vertex sets N1, N2, . . . , Nk ⊆ V , called nets. Then a noncrossing Steiner forest forN in G is a set T of k trees T1, T2, . . . , Tk in G such that each tree Ti ∈ T connects all vertices, called terminals, in net Ni , any two trees in T do not cross each other, and the sum of edge weights of all trees is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 21 شماره
صفحات -
تاریخ انتشار 1999